Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Noise type recognition and intensity estimation based on K-nearest neighbors algorithm
WU Xiaoli, ZHENG Yifeng
Journal of Computer Applications    2020, 40 (1): 264-270.   DOI: 10.11772/j.issn.1001-9081.2019061109
Abstract414)      PDF (1150KB)(277)       Save
For the problem that the existing methods for noise type recognition and intensity estimation all focus on single noises, and cannot estimate the intensity of source noises in the mixed noises, a K-Nearest Neighbors ( KNN) algorithm with distance threshold was proposed to recognize the single and mixed noises, and estimate the intensity of source noises in the mixed noises by combining the recognition results of mixed noises and the reconstruction of noise bases. Firstly, the data distribution in frequency domain was used as feature vector. Then the signals were identified by the noise type recognition algorithm, and the frequency domain cosine distance between reconstructed noise and real noise was adopted as the optimal evaluation criterion in the process of reconstruction of noise bases. Finally, the intensity of source noises was estimated. The experimental results on two test databases indicate that, the proposed algorithm has the average accuracy of noise type identification as high as 98.135%, and the error rate of intensity estimation of mixed noise of 20.96%. The results verify the accuracy and generalization of noise type recognition algorithm as well as the feasibility of mixed noise intensity estimation algorithm, and this method provides a new idea for the mixed noise intensity estimation. The information of mixed noise type and intensity obtained by this method contributes to the determination of denoising methods and parameters, and improves the denoising efficiency.
Reference | Related Articles | Metrics
Monte Carlo boxed localization algorithm for mobile nodes based on received signal strength indication ranging
WU Xiaolin, SHAN Zhilong, CAO Shulin, CAO Chuqun
Journal of Computer Applications    2015, 35 (4): 916-920.   DOI: 10.11772/j.issn.1001-9081.2015.04.0916
Abstract585)      PDF (768KB)(736)       Save

To solve the shortcomings of sampling efficiency and positioning accuracy of the Monte Carlo localization algorithm in Wireless Sensor Networks (WSN), a Monte Carlo localization Boxed (MCB) algorithm for mobile nodes based on Received Signal Strength Indication (RSSI) ranging was proposed. To improve the positioning accuracy, the filter conditions was strengthened by mapping the ranging information into different distance intervals. At the same time, the samples which had already met the filter conditions were used to create more effective samples so as to improve the sampling efficiency. Finally, the Newton interpolation was used to predict the nodes' trajectory. The closer the trajectory between the sample and the node is, the greater the weight of the sample is, and the best estimate position could be obtained with these weighted samples. The simulation results indicate that the proposed algorithm has good performance in different density of anchor node, communication radius, and movement velocity etc., and compared with the MCB algorithm, the proposed algorithm has higher positioning accuracy.

Reference | Related Articles | Metrics